Ordered Greed for N SuperQueens
نویسنده
چکیده
This is an extension of the Ordered Greed technique introduced by Anderson and Gustafson in [1]. The Ordered Greed algorithm (OG) is a hybrid greedy algorithm using permutations. OG is applicable to many classical optimization problems, including job assignment, graph coloring, bin packing, and satisfiability. Here, OG is applied to a variant of the N Queens problem, the N SuperQueens problem. The performance of the OG method and that of the Plain Permutation GA in solving the N SuperQueens problem are compared. The results here support those found in [1], that the OG method is far superior to the Plain Permutation GA. 1 N SuperQueens N SuperQueens is an extension of the classical N Queens problem where the task is to place N chess queens on an N ×N board such that no two queens are attacking each other. The normal queens attack along rows, columns, and diagonals. A SuperQueen has all of the attacking abilities of a normal queen along with those of the chess knight. The task remains to place N
منابع مشابه
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed model of privacy protection is kAnonymity, where a dataset is k-anonymous if each record is identical to at least (k-1) others in the dataset. Our goal is to minimize information loss while transforming a collection of records to s...
متن کاملGENERALIZED UNI-SOFT INTERIOR IDEALS IN ORDERED SEMIGROUPS
For all M,N∈P(U) such that M⊂N, we first introduced the definitions of (M,N)-uni-soft ideals and (M,N)-uni-soft interior ideals of an ordered semigroup and studied them. When M=∅ and N=U, we meet the ordinary soft ones. Then we proved that in regular and in intra-regular ordered semigroups the concept of (M,N)-uni-soft ideals and the (M,N)-uni-soft interior ideals coincide. Finally, we introduc...
متن کاملRandom coincidence point results for weakly increasing functions in partially ordered metric spaces
The aim of this paper is to establish random coincidence point results for weakly increasing random operators in the setting of ordered metric spaces by using generalized altering distance functions. Our results present random versions and extensions of some well-known results in the current literature.
متن کاملGeneralized $F$-contractions in Partially Ordered Metric Spaces
We discuss about the generalized $F$-contraction mappings in partially ordered metric spaces. For this, we first introduce the notion of ordered weakly $F$-contraction mapping. We also present some fixed point results about this type of mapping in partially ordered metric spaces. Next, we introduce the notion of $acute{mathrm{C}}$iri$acute{mathrm{c}}$ type generalized ordered weakly $F$-contrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002